Program slicing is a technique to extract the part of a program (the slice) that influences or is influenced by a set of variables at a\ngiven point (the slicing criterion). Computing minimal slices is undecidable in the general case, and obtaining the minimal slice\nof a given program is normally computationally prohibitive even for very small programs. Therefore, no matter what program\nslicer we use, in general, we cannot be sure that our slices are minimal. This is probably the fundamental reason why no\nbenchmark collection of minimal program slices exists. In this work, we present a method to automatically produce quasiminimal\nslices. Using our method, we have produced a suite of quasi-minimal slices for Erlang that we have later manually\nproved they are minimal. We explain the process of constructing the suite, the methodology and tools that were used, and the\nresults obtained. The suite comes with a collection of Erlang benchmarks together with different slicing criteria and the\nassociated minimal slices.
Loading....